翻訳と辞書 Words near each other ・ transport layer security protocol ・ transport level interface ・ transport service access point ・ transputer ・ trap ・ trap door ・ trap-door function ・ trash ・ trash-80 ・ traveling salesman problem ・ travelling salesman problem ・ traversal ・ traverse ・ trawl ・ tree ・ tree transformation language ・ tree-killer ・ treet ・ treetran ・ treeware Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク travelling salesman problem ： FOLDOC travelling salesman problem (TSP or "shortest path", US: "traveling") Given a set of towns and the distances between them, determine the shortest path starting from a given town, passing through all the other towns and returning to the first town. This is a famous problem with a variety of solutions of varying complexity and efficiency. The simplest solution (the brute force approach) generates all possible routes and takes the shortest. This becomes impractical as the number of towns, N, increases since the number of possible routes is !(N-1). A more intelligent algorithm (similar to iterative deepening) considers the shortest path to each town which can be reached in one hop, then two hops, and so on until all towns have been visited. At each stage the algorithm maintains a "frontier" of reachable towns along with the shortest route to each. It then expands this frontier by one hop each time. {Pablo Moscato's TSP bibliography (http://densis.fee.unicamp.br/~mos スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.